Model-completeness in a first order language with a generalized quantifier
نویسندگان
چکیده
منابع مشابه
On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic
Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifier Q into a first-order language enriched with a family of predicates Rs, for every arity i (or an infinitary predicate R) which takes Qz~(z, yl, . . . , y,~) to Vz(R(z, yl,..., g,~) --" ~b(x, Yl,..., Y,~)) (gl . . . . . g~ are precisely the free variables of Qzq~). The logic of Q (without ordinary quan...
متن کاملA First Order Language
In the paper a first order language is constructed. It includes the universal quantifier and the following propositional connectives: truth, negation, and conjunction. The variables are divided into three kinds: bound variables, fixed variables, and free variables. An infinite number of predicates for each arity is provided. Schemes of structural induction and schemes justifying definitions by ...
متن کاملCompleteness of a First-Order Temporal Logic with Time-Gaps
The rst-order temporal logics with 2 and of time structures isomorphic to ! (discrete linear time) and trees of !-segments (linear time with branching gaps) and some of its fragments are compared: The rst is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.
متن کاملSlicewise Definability in First-Order Logic with Bounded Quantifier Rank
Abstract For every q ∈ N let FOq denote the class of sentences of first-order logic FO of quantifier rank at most q. If a graph property can be defined in FOq, then it can be decided in time O(n). Thus, minimizing q has favorable algorithmic consequences. Many graph properties amount to the existence of a certain set of vertices of size k. Usually this can only be expressed by a sentence of qua...
متن کاملOne quantifier alternation in first-order logic with modular predicates
Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[<,MOD] with order comparison x < y and predicates for x ≡ i mod n has been investigated by Barrington, Compton, Straubing and Thérien. The study of FO[<,MOD]fragments was initiated by Chaubard, Pin and Straubing. More recently, Dartois and Paperman showed that definability in the two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1975
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1975.56.265